Combining Retiming and Sequential Redundancy Addition and Removal for Sequential Logic Optimization

نویسندگان

  • ENRIQUE SAN MILLÁN
  • LUIS ENTRENA
  • LUIS MENGIBAR
  • MICHAEL GARCÍA
چکیده

In this paper a new logic optimization method for sequential synchronous circuits is introduced. For this purpose the current main approaches, “Retiming and Resynthesis” and “Redundancy Addition and Removal” are considered. These techniques have some advantages and limitations that have been theoretically proven by several authors. The goal of the new optimization method is to combine these two techniques to get the best of each one. In particular the paper is focused on area optimization. The algorithm proposed in this paper is efficient and delivers interesting optimization results. Key-Words: Sequential logic optimization, Digital Circuits, Retiming and Resynthesis, Redundancy Addition and Removal

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Min-Area Retiming on Dynamic Circuit Structures

In this paper we present two techniques for improving min-area retiming that combine the actual register minimization with combinational optimization. First, we discuss an on-the-fly retiming approach based on a sequential AND/INVERTER/REGISTER graph. With this method the circuit structure is sequentially compacted using a combination of register “dragging” and AND vertex hashing. Second, we pr...

متن کامل

An ATPG-Based Framework for Verifying Sequential Equivalence

In this paper, we address the problem of verifying the equivalence of two sequential circuits. State-of-the-art sequential optimization techniques such as retiming and sequential redundancy removal can handle designs with up to hundreds or even thousands of flip-flops. The BDDbased approaches for equivalence checking can easily run into memory explosion for such designs. With an attempt to hand...

متن کامل

Sequential Logic Optimization with Implicit Retiming and Resynthesis

This paper introduces a new logic transformation that integrates retiming with algebraic and Boolean transformations at the technology-independent level. It ooers an additional degree of freedom in sequential network optimization resulting from implicit retiming across logic blocks and fanout stems. The application of this transformation to sequential network synthesis results in the optimizati...

متن کامل

Optimal Retiming for Initial State Computation

Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state for the retimed circuit. In this paper we propose a new efficient retiming algorithm for performance optimization. The retiming determined by the algorithm is the best with respect to initial state computation. It is th...

متن کامل

Structure-Driven Equivalence Verification for Circuits Optimized by Retiming and Combinational Synthesis

Sequential optimization techniques fall in two broad categories: state-based and structure-based [4]. Structurebased techniques optimize a circuit netlist by interleaving retiming and combinational synthesis in different ways to improve design metrics such as delay, area, and power. Examples of such optimizations include among others: peripheral retiming [7], architectural retiming [6], and ite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006